-
1 modulo sum of
Большой англо-русский и русско-английский словарь > modulo sum of
-
2 modulo sum of
-
3 modulo sum of
мат. -
4 sum
1) сумма
2) суммарный
3) итог
4) задача
5) суммировать
6) складывать
7) резюмировать
8) просуммировать
9) слагаемое
– algebraic sum
– check sum
– check sum failure
– debit sum against
– direct sum
– do a sum
– final sum
– form sum of
– if we sum
– modulo sum of
– partial sum
– static sum
– sum accumulator
– sum frequency
– sum total
– sum total rule
– sum up
– vector sum
discrete direct sum — <math.> сумма прямая слабая, дискретная сумма
take sum over all integers — брать сумму по всем целым значениям
-
5 modulo
-
6 sum
1) сумма; итог || суммировать, складывать; подводить итог3) резюмировать•sum over sum — мат. сумма вдоль подпространства
sum taken over — сумма, взятая по…
to sum up — резюмировать, суммировать
to sum with respect to — суммировать по...
- free sum- rank sum- regression sum of squares- risk sum- row sum- sum of squares for contrasts- unit sum -
7 sum
1) сумма || суммировать, складывать2) объединение ( множеств) || объединять ( множества)3) резюме; итог || резюмировать; подводить итог; суммировать•- sum of operators
- sum of products
- sum of series
- sum of sets
- sum of squares
- algebraic sum
- approximate sum
- arithmetic sum
- check sum
- column sum
- cumulative sum - logic sum
- logical sum
- lower sum
- modulo N-sum
- negative sum
- non-zero sum
- positive sum
- rank sum
- residual sum
- residual sum of squares
- row sum
- running sum
- statistical sum
- topological sum
- total sum of squares
- upper sum
- vector sum
- weighted sum
- zero sum -
8 sum
1) сумма || суммировать, складывать2) объединение ( множеств) || объединять ( множества)3) резюме; итог || резюмировать; подводить итог; суммировать•- approximate sum
- arithmetic sum
- check sum
- column sum
- cumulative sum of squares
- cumulative sum
- explained sum of squares
- logic sum
- logical sum
- lower sum
- modulo N sum
- negative sum
- non-zero sum
- positive sum
- rank sum
- residual sum of squares
- residual sum
- row sum
- running sum
- statistical sum
- sum of matrices
- sum of operators
- sum of products
- sum of series
- sum of sets
- sum of squares
- topological sum
- total sum of squares
- upper sum
- vector sum
- weighted sum
- zero sumThe New English-Russian Dictionary of Radio-electronics > sum
-
9 sum
1) сумма; итог || суммировать, складывать; подводить итог2) мн. ч. арифметика•sum to infinity — сумма бесконечной геометрической прогрессии-
algebraic sum
-
alternating sum
-
arithmetic sum
-
check sum
-
finite sum
-
integral sum
-
logical sum
-
lower sum
-
modulo N sum
-
ordered sum
-
partial sum
-
trigonometric sum
-
upper sum
-
vectorial sum
-
vector sum -
10 sum
1) сумма; итог || суммировать, складывать; подводить итог3) pl арифметика•- do sums- accumulated sum
- check sum
- final sum
- initial sum
- intermediate sum
- logical sum
- modulo N sum
- not sum
- partial sum
- partial-product sum
- running sum
- sideways sum
- sum of N-th powers
- sum of products
- sum to infinity
- vector sumEnglish-Russian dictionary of computer science and programming > sum
-
11 sum
-
12 modulo N sum
Большой англо-русский и русско-английский словарь > modulo N sum
-
13 modulo-two sum gate
Большой англо-русский и русско-английский словарь > modulo-two sum gate
-
14 modulo [modulus] N sum
Англо-русский словарь технических терминов > modulo [modulus] N sum
-
15 modulo-two sum gate
Англо-русский словарь технических терминов > modulo-two sum gate
-
16 modulo 2 sum
Техника: сумма по модулю 2 -
17 modulo 2 sum gate
Техника: схема сложения по модулю 2 -
18 modulo N sum
Техника: сумма по модулю N -
19 modulo n sum
Техника: сумма по модулю N -
20 modulo-two sum gate
1) Техника: схема сложения по модулю 22) Вычислительная техника: вентиль сложения по модулю 2
См. также в других словарях:
Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… … Wikipedia
Kummer sum — In mathematics, Kummer sum is the name given to certain cubic Gauss sums for a prime modulus p , with p congruent to 1 modulo 3. They are named after Ernst Kummer, who made a conjecture about the statistical properties of their arguments, as… … Wikipedia
Exponential sum — In mathematics, an exponential sum may be a finite Fourier series (i.e. a trigonometric polynomial), or other finite sum formed using the exponential function, usually expressed by means of the function:e(x) = exp(2pi ix).Therefore a typical… … Wikipedia
Kloosterman sum — In mathematics, a Kloosterman sum is a particular kind of exponential sum. Let a , b , m be natural numbers. Then :K(a,b;m)=sum {0leq xleq m 1, gcd(x,m)=1 } e^{2pi i (ax+bx^*)/m},Here x* is the inverse of x modulo m . They are named for the Dutch … Wikipedia
Quadratic Gauss sum — For the general type of Gauss sums see Gaussian period, Gauss sumIn mathematics, quadratic Gauss sums are certain sums over exponential functions with quadratic argument. They are named after Carl Friedrich Gauss, who studied them… … Wikipedia
Gauss sum — In mathematics, a Gauss sum or Gaussian sum is a particular kind of finite sum of roots of unity, typically: G ( chi;, psi;) = Sigma; chi;( r ) psi;( r )where the sum is over elements r of some finite commutative ring R , psi;( r ) is a group… … Wikipedia
Character sum — In mathematics, a character sum is a sum of values of a Dirichlet character χ modulo N, taken over a given range of values of n. Such sums are basic in a number of questions, for example in the distribution of quadratic residues, and in… … Wikipedia
Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… … Wikipedia
Barycentric-sum problem — Combinatorial number theory deals with number theoretic problems which involve combinatorial ideas in their formulations or solutions. Paul Erdős is the main founder of this branch of number theory. Typical topics include covering system, zero… … Wikipedia
Jacobi sum — In mathematics, a Jacobi sum is a type of character sum formed with one or more Dirichlet characters. The simplest example would be for a Dirichlet character χ modulo a prime number p . Then take: J (χ) = Σ χ( a )χ(1 − a ) where the summation… … Wikipedia
PESEL — (Polish Powszechny Elektroniczny System Ewidencji Ludności, Universal Electronic System for Registration of the Population) is the national identification number used in Poland since 1979. It always has 11 digits, identifies just one person and… … Wikipedia